Uniqueness of Optimal Cube Wrapping
نویسنده
چکیده
Consider wrapping the unit cube with a square without stretching or cutting. Beebee demonstrated such a wrapping with a square of side length 2 √ 2, and proved that no smaller square can fulfill the task [1]. We show that Beebee’s construction is the unique optimal wrapping, up to the symmetries of the unit cube and the placement of the junk material.
منابع مشابه
Reconstruction Conjecture for Graphs Isomorphic to Cube of a Tree
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i) characterization of the cube of a tree (ii) recognizability of the cube of a tree (iii) uniqueness of tree as a cube root of a graph G, except when G is a complete gr...
متن کاملOn Wrapping Spheres and Cubes with Rectangular Paper
What is the largest cube or sphere that a given rectangular piece of paper can wrap? This natural problem, which has plagued giftwrappers everywhere, remains very much unsolved. Here we introduce new upper and lower bounds and consolidate previous results. Though these bounds rarely match, our results significantly reduce the gap.
متن کاملMedia theory: Representations and examples
In this paper we develop a representational approach to media theory. We construct representations of media by well-graded families of sets and partial cubes and establish the uniqueness of these representations. Two particular examples of media are also described in detail. © 2007 Elsevier B.V. All rights reserved.
متن کاملOptimal Routing in the Cube-Connected Cycles Interconnection Network
An optimal message routing algorithm for thc cube-connected cycles processor interconnection network is described, and the average:message path length is derived assuming a uniform message routing distribution. The optimal algorithm is comparetl to one preViously proposed and is shown to have significanlly shorter average path length.
متن کاملDense matrix operations on a torus and a boolean cube
Algorithms for matrix multiplication and for Gauss-Jordan and Gaussian elimination on dense matrices on a torus and a boolean cube are presented and analyzed with respect to communication and arithmetic complexity. The number of elements of the matrices is assumed to be larger than the number of nodes in the processing system. The algorithms for matrix multiplication, triangulation, and forward...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014